Distributed estimation of principal eigenspaces
نویسندگان
چکیده
منابع مشابه
On the Convergence of Eigenspaces in Kernel Principal Component Analysis
This paper presents a non-asymptotic statistical analysis of KernelPCA with a focus different from the one proposed in previous work on this topic ([2], [9]). Here instead of considering the reconstruction error of KPCA we are interested in approximation error bounds for the eigenspaces themselves. We prove an upper bound depending on the spacing between eigenvalues but not on the dimensionalit...
متن کاملPose Estimation using 3D View-Based Eigenspaces
In this paper we present a method for estimating the absolute pose of a rigid object based on intensity and depth viewbased eigenspaces, built across multiple views of example objects of the same class. Given an initial frame of an object with unknown pose, we reconstruct a prior model for all views represented in the eigenspaces. For each new frame, we compute the pose-changes between every vi...
متن کاملPrincipal Frame and Principal Quadric Estimation
The principal frame and principal quadric form a fundamental description of a smooth surface at a point. This paper is concerned with estimating these from the 3D data acquired by a sensor such as a structured light system. Eight diierent estimation methods are described and a comparison of their performance is presented.
متن کاملImproved Distributed Principal Component Analysis
We study the distributed computing setting in which there are multiple servers,each holding a set of points, who wish to compute functions on the union of theirpoint sets. A key task in this setting is Principal Component Analysis (PCA), inwhich the servers would like to compute a low dimensional subspace capturing asmuch of the variance of the union of their point sets as possi...
متن کاملDistributed Kernel Principal Component Analysis
Kernel Principal Component Analysis (KPCA) is a key technique in machine learning for extracting the nonlinear structure of data and pre-processing it for downstream learning algorithms. We study the distributed setting in which there are multiple workers, each holding a set of points, who wish to compute the principal components of the union of their pointsets. Our main result is a communicati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 2019
ISSN: 0090-5364
DOI: 10.1214/18-aos1713